Simple Recurrent Networks and human spoken word recognition
نویسنده
چکیده
A crucial problem in cognitive science, especially for speech processing, is sequence encoding. Models of spoken word recognition either ignore the problem (e.g., Norris et al., 2000), posit solutions incapable of representing repeated elements (e.g., Grossberg & Kazerounian, 2011), or ”spatialize” time in possibly unrealistic ways (TRACE; McClelland & Elman, 1986). An alternative that has not been deeply explored for spoken word recognition is the Simple Recurrent Network (Elman, 1990). I trained SRNs on the TRACE lexicon with pseudo-spectral inputs, and used regression to compare fundamental effects (neighborhood, cohort, length, etc.) in SRNs vs. TRACE and TISK (Hannagan, Magnuson, & Grainger, 2013), and the finegrained time course of those effects. In general, SRN predictions converge with TRACE and TISK, and are consistent with human behavior. However, some attested effects (e.g., short-word bias) do not emerge naturally in SRNs, calling into question their adequacy as models of human spoken word recognition.
منابع مشابه
Simple Recurrent Networks and Competition Effects in Spoken Word Recognition
Continuous mapping models of spoken word recognition such as TRACE (McClelland and Elman, 1986) make robust predictions about a wide variety of phenomena. However, most of these models are interactive activation models with preset weights, and do not provide an account of learning. Simple recurrent networks (SRNs, e.g., Elman, 1990) are continuous mapping models that can process sequential patt...
متن کاملEncoding Word Confusion Networks with Recurrent Neural Networks for Dialog State Tracking
This paper presents our novel method to encode word confusion networks, which can represent a rich hypothesis space of automatic speech recognition systems, via recurrent neural networks. We demonstrate the utility of our approach for the task of dialog state tracking in spoken dialog systems that relies on automatic speech recognition output. Encoding confusion networks outperforms encoding th...
متن کاملOptimal Tailoring of Trajectories, Growing Training Sets and Recurrent Networks for Spoken Word Recognition
A novel system that efficiently integrates two types of neural networks for reliably performing isolated word recognition is described. The recognition system comprises of a feature extractor that includes a Self Organizing Map for an optimal tailoring of trajectory representations of words in reduced dimension feature spaces. Experimental results indicate that such lower dimensional trajectori...
متن کاملUsing word confusion networks for slot filling in spoken language understanding
Semantic slot filling is one of the most challenging problems in spoken language understanding (SLU) because of automatic speech recognition (ASR) errors. To improve the performance of slot filling, a successful approach is to use a statistical model that is trained on ASR one-best hypotheses. The state of the art models for slot filling rely on using discriminative sequence modeling methods, s...
متن کاملLexical Segmentation and Ambiguity: Investigating the Recognition of Onset-embedded Words
The lack of acoustic markers of word boundaries in connected speech may create temporary ambiguities between words like cap and the start of longer words like captain. These ambiguities have motivated models of spoken word recognition in which lexical competition allows information after the end of an embedded word to assist identification. We review the results of priming experiments demonstra...
متن کامل